Algebraic computation of resolvents without extraneous powers
نویسندگان
چکیده
This paper presents an algorithm for computing algebraically relative resolvents which enhances an existing algorithm by avoiding the accumulation of superfluous powers in the intermediate computations. The superfluous power generated at each step is predetermined over a certain quotient ring. As a byproduct, an efficient algorithm for extracting an n-th root of a univariate polynomial is obtained. © 2012 Elsevier Ltd. All rights reserved.
منابع مشابه
Kummer, Eisenstein, Computing Gauss Sums as Lagrange Resolvents
In fact, [Eisenstein 1850] evaluated cubes and fourth powers of Gauss sums attached to cubic and quartic characters to prove the corresponding reciprocity laws. One essential point is the p-adic approximation of Gauss sums by [Kummer 1847], generalized in [Stickelberger 1890]. Since the rings of algebraic integers generated by third or fourth roots of unity have class number one and finitely-ma...
متن کاملFormal Computation of Galois Groups with Relative Resolvents
We propound a systematic and formal method to compute the Galois group of a non-necessarily irreducible polynomial: we proceed by successive inclusions, using mostly computations on scalars (and very few on polynomials). It is based on a formal method of specialization of relative resolvents: it consists in expressing the generic coeecients of the resolvent using the powers of a primitive eleme...
متن کاملUsing Galois Ideals for Computing Relative Resolvents
Let k be a perfect field and k̄ an algebraic closure of k. Let f be a separable univariate polynomial of k[X] with degree n, and Ω be an ordered set of the n distinct roots of f in k̄. In Valibouze (1999) the notion of ideal of Ω-relations invariant by a subset L of the symmetric group of degree n is introduced. It generalizes the notion of ideal of relations and the notion of ideal of symmetric ...
متن کاملCorrigendum to "On a family of Laguerre methods to find multiple roots of nonlinear equations"
There are several methods for solving a nonlinear algebraic equation having roots of a given multiplicity m. Here we compare a family of Laguerre methods of order three as well as two others of the same order and show that Euler–Cauchy’s method is best. We discuss the conjugacy maps and the effect of the extraneous roots on the basins of attraction. Published by Elsevier Inc.
متن کاملGalois Theory and Reducible Polynomials
This paper presents works on reducible polynomials in Galois theory. It gives a fundamental theorem about the Galois ideals associated with a product of groups. These results are used for the practical determination of Galois groups of polynomials of degrees up to 7. : : :). The following tools are used: resolvents (relative or absolute), p-adic methods, Grr obner bases or block systems. In gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012